A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW - Extended version

We consider a dynamic vehicle routing problem with time windows and stochastic customers (DS-VRPTW), such that customers may request for services as vehicles have already started their tours. To solve this problem, the goal is to provide a decision rule for choosing, at each time step, the next action to perform in light of known requests and probabilistic knowledge on requests likelihood. We introduce a new decision rule, called Global Stochastic Assessment (GSA) rule for the DS-VRPTW, and we compare it with existing decision rules, such as MSA. In particular, we show that GSA fully integrates nonanticipativity constraints so that it leads to better decisions in our stochastic context. We describe a new heuristic approach for efficiently approximating our GSA rule. We introduce a new waiting strategy. Experiments on dynamic and stochastic benchmarks, which include instances of different degrees of dynamism, show that not only our approach is competitive with state-of-the-art methods, but also enables to compute meaningful offline solutions to fully dynamic problems where absolutely no a priori customer request is provided.Comment: Extended version of the same-name study submitted for publication in conference CPAIOR201

Continuous relaxation of MINLP problems by penalty functions: a practical comparison

A practical comparison of penalty functions for globally solving mixed-integer nonlinear programming (MINLP) problems is presented. The penalty approach relies on the continuous relaxation of the MINLP problem by adding a specific penalty term to the objective function. A new penalty algorithm that addresses simultaneously the reduction of the error tolerances for optimality and feasibility, as well as the reduction of the penalty parameter, is designed. Several penalty terms are tested and different penalty parameter update schemes are analyzed. The continuous nonlinear optimization problem is solved by the deterministic DIRECT optimizer. The numerical experiments show that the quality of the produced solutions are satisfactory and that the selected penalties have different performances in terms of efficiency and robustness.This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Fundação para a Ciência e Tecnologia, within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio

Stability of Mine Car Motion in Curves of Invariable and Variable Radii

We discuss our experiences adapting three recent algorithms for maximum common (connected) subgraph problems to exploit multi-core parallelism. These algorithms do not easily lend themselves to parallel search, as the search trees are extremely irregular, making balanced work distribution hard, and runtimes are very sensitive to value-ordering heuristic behaviour. Nonetheless, our results show that each algorithm can be parallelised successfully, with the threaded algorithms we create being clearly better than the sequential ones. We then look in more detail at the results, and discuss how speedups should be measured for this kind of algorithm. Because of the difficulty in quantifying an average speedup when so-called anomalous speedups (superlinear and sublinear) are common, we propose a new measure called aggregate speedup

Bound states of the Dirac equation on Kerr spacetime

We formulate the Dirac equation for a massive neutral spin-half particle on a rotating black hole spacetime, and we consider its (quasi)bound states: gravitationally-trapped modes which are regular across the future event horizon. These bound states decay with time, due to the absence of superradiance in the (single-particle) Dirac field. We introduce a practical method for computing the spectrum of energy levels and decay rates, and we compare our numerical results with known asymptotic results in the small-Mμ and large-Mμ regimes. By applying perturbation theory in a horizon-penetrating coordinate system, we compute the 'fine structure' of the energy spectrum and find good agreement with numerical results. We obtain data for a hyperfine splitting due to black hole rotation. We evolve generic initial data in the time domain, and show how Dirac bound states appear as spectral lines in the power spectra. In the rapidly-rotating regime, we find that the decay of low-frequency co-rotating modes is suppressed in the (bosonic) superradiant regime. We conclude with a discussion of physical implications and avenues for further work

Multi-Round Trust Game Quantifies Inter-Individual Differences in Social Exchange from Adolescence to Adulthood

Investing in strangers in a socio-economic exchange is risky, as we may be uncertain whether they will reciprocate. Nevertheless, the potential rewards for cooperating can be great. Here, we used a cross sectional sample (n = 784) to study how the challenges of cooperation versus defection are negotiated across an important period of the lifespan: from adolescence to young adulthood (ages 14 to 25). We quantified social behaviour using a multi round investor-trustee task, phenotyping individuals using a validated model whose parameters characterise patterns of real exchange and constitute latent social characteristics. We found highly significant differences in investment behaviour according to age, sex, socio-economic status and IQ. Consistent with the literature, we showed an overall trend towards higher trust from adolescence to young adulthood but, in a novel finding, we characterized key cognitive mechanisms explaining this, especially regarding socio-economic risk aversion. Males showed lower risk-aversion, associated with greater investments. We also found that inequality aversion was higher in females and, in a novel relation, that socio-economic deprivation was associated with more risk averse play

Stochastic Bundle Adjustment for Efficient and Scalable 3D Reconstruction

Current bundle adjustment solvers such as the Levenberg-Marquardt (LM) algorithm are limited by the bottleneck in solving the Reduced Camera System (RCS) whose dimension is proportional to the camera number. When the problem is scaled up, this step is neither efficient in computation nor manageable for a single compute node. In this work, we propose a stochastic bundle adjustment algorithm which seeks to decompose the RCS approximately inside the LM iterations to improve the efficiency and scalability. It first reformulates the quadratic programming problem of an LM iteration based on the clustering of the visibility graph by introducing the equality constraints across clusters. Then, we propose to relax it into a chance constrained problem and solve it through sampled convex program. The relaxation is intended to eliminate the interdependence between clusters embodied by the constraints, so that a large RCS can be decomposed into independent linear sub-problems. Numerical experiments on unordered Internet image sets and sequential SLAM image sets, as well as distributed experiments on large-scale datasets, have demonstrated the high efficiency and scalability of the proposed approach. Codes are released at https://github.com/zlthinker/STBA.Comment: Accepted by ECCV 202

Globally convergent evolution strategies for constrained optimization

International audienceIn this paper we propose, analyze, and test algorithms for constrained optimization when no use of derivatives of the objective function is made. The proposed methodology is built upon the globally convergent evolution strategies previously introduced by the authors for unconstrained optimization. Two approaches are encompassed to handle the constraints. In a first approach, feasibility is first enforced by a barrier function and the objective function is then evaluated directly at the feasible generated points. A second approach projects first all the generated points onto the feasible domain before evaluating the objective function.The resulting algorithms enjoy favorable global convergence properties (convergence to stationarity from arbitrary starting points), regardless of the linearity of the constraints.The algorithmic implementation (i) includes a step where previously evaluated points are used to accelerate the search (by minimizing quadratic models) and (ii) addresses the particular cases of bounds on the variables and linear constraints. Our solver is compared to others, and the numerical results confirm its competitiveness in terms of efficiency and robustness

The influence of semantic and phonological factors on syntactic decisions: An event-related brain potential study

During language production and comprehension, information about a word's syntactic properties is sometimes needed. While the decision about the grammatical gender of a word requires access to syntactic knowledge, it has also been hypothesized that semantic (i.e., biological gender) or phonological information (i.e., sound regularities) may influence this decision. Event-related potentials (ERPs) were measured while native speakers of German processed written words that were or were not semantically and/or phonologically marked for gender. Behavioral and ERP results showed that participants were faster in making a gender decision when words were semantically and/or phonologically gender marked than when this was not the case, although the phonological effects were less clear. In conclusion, our data provide evidence that even though participants performed a grammatical gender decision, this task can be influenced by semantic and phonological factors

A Note on Vectorial AdS5_5/CFT4_4 Duality for Spin-jj Boundary Theory

The vectorial holographic correspondences between higher-spin theories in AdS$_5$ and free vector models on the boundary are extended to the cases where the latter is described by free massless spin-$j$ field. The dual higher-spin theory in the bulk does not include gravity and can only be defined on rigid AdS$_5$ background with $S^4$ boundary. We discuss various properties of these rather special higher-spin theories and calculate their one-loop free energies. We show that the result is proportional to the same quantity for spin-$j$ doubleton treated as if it is a AdS$_5$ field. Finally, we consider even more special case where the boundary theory itself is given by an infinite tower of massless higher-spin fields.Comment: 27 pages, version to appear in JHE